Performance Evaluation of an Optimistic Concurrency Control Algorithm Ensuring Strong Consistency for Transaction Time Relations
نویسندگان
چکیده
In this paper, we study the performance of an access concurrency control algorithm for transaction time relations. This algorithm is based on the optimistic approach and detects conflicts as soon as possible. By using EOT marker technique, it has the merit to reduce to the maximum the period during which resources are locked in the validation phase [3]. We have, in previous works, made a formal verification of this algorithm using the SPIN model checker [10]. Now, we proceed to its experimental evaluation vis-à-vis of other well-known concurrency control mechanisms based on an optimistic and pessimistic approach.
منابع مشابه
Formal verification of a new optimistic concurrency control algorithm for temporal databases
Most of the concurrency control (CC) studies in the temporal database areas were carried out according to the pessimistic approach ([7][8][9]). To our knowledge, OCCA_SC/TTR [5] and OCCA_SC/VTR [15] algorithms, which ensure the strong consistency for transaction time relations and for valid time relations, respectively, are the only ones which adopt the optimistic approach. We propose in this p...
متن کاملAn Optimistic Concurrency Control Approach Applied to Temporal Data in Real-time Database Systems
Real-time database systems (RTDBS) have received growing attention in recent years. RTDBS is a database system where transactions have explicit timing constraints such as deadlines. The performance and the correctness of RTDBS are highly dependent on how well these deadlines can be met. Scheduling of transactions is driven by priority considerations rather than fairness considerations. Concurre...
متن کاملA New Approach to Real-Time Transaction Scheduling
A real-time database system differs from a conventional database system because in addition to the consistency constraints of the database, timing constraints of individual transaction need to be satisfied. Various real-time transaction scheduling algorithms have been proposed which employ either a pessimistic or an optimistic approach to concurrency control. In this paper, we present new real-...
متن کاملConcurrency Control in Real - Time Database Systems : Optimistic Scheme vs . Two - Phase Locking
The two-phase locking approach widely used for concurrency control in database systems have some inherent disadvantages such as deadlock and unpredictable blocking time. These appear to be serious problems with respect to real-time transaction processing , since in a real-time environment transactions need to meet their time constraints as well as their consistency requirements. Integrated with...
متن کاملLICRA: A Replicated-Data Management Algorithm for Distributed Synchronous Groupware Applications
Replicated data consistency is a key issue in the design of distributed real time groupware applications. In this paper, we propose a new protocol to cope with this problem. The proposed algorithm guarantees an optimal response time while ensuring data consistency at system quiescence. The originality of our proposition relies on the fact that no locks nor clocks nor global information are requ...
متن کامل